Programming With Unrestricted Natural Language
نویسندگان
چکیده
We argue it is better to program in a natural language such as English, instead of a programming language like Java. A natural language interface for programming should result in greater readability, as well as making possible a more intuitive way of writing code. In contrast to previous controlled language systems, we allow unrestricted syntax, using wide-coverage syntactic and semantic methods to extract information from the user’s instructions. We also look at how people actually give programming instructions in English, collecting and annotating a corpus of such statements. We identify differences between sentences in this corpus and in typical newspaper text, and the effect they have on how we process the natural language input. Finally, we demonstrate a prototype system, that is capable of translating some English instructions into executable code.
منابع مشابه
Determining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملImproving the Precision of Information Retrieval Systems Using Syntactic Relations
The Problem: Traditional information retrieval systems based on the “bag-of-words” paradigm cannot capture the semantic content of documents. While these systems are relatively robust and have high recall, they suffer from very poor precision. On the other hand, it is impossible with current technology to build a practical information access system that fully analyzes and understands unrestrict...
متن کاملSapere: Improving the Precision of Information Retrieval Systems Using Syntactic Relations
The Problem: Traditional information retrieval systems based on the “bag-of-words” paradigm cannot capture the semantic content of documents. While these systems are relatively robust and have high recall, they suffer from very poor precision. On the other hand, it is impossible with current technology to build a practical information access system that fully analyzes and understands unrestrict...
متن کاملNeural Associative Memory with Finite State Technology
Morphological learning approaches have been successfully applied to morphological tasks in computational linguistics including morphological analysis and generation. We take a new look at the fundamental properties of associative memory along with the power of turing machine and show how it can be adopted for natural language processing. The ability to store and recall stored patterns based on ...
متن کاملMachine learning and automatic linguistic analysis: the next step
In order to continue building systems with progressively more complex natural language capabilities, it is crucial that great strides are made toward solving the core linguistic analysis problems for complex and possibly unrestricted domains. A great deal of progress has been made by applying machine learning techniques to automatically train systems from manually annotated corpora to provide d...
متن کامل